Structural and spectral properties of minimal strong digraphs

In this article, we focus on structural and spectral properties of minimal strong digraphs (MSDs). We carry out a comparative study of properties of MSDs versus trees. This analysis includes two new properties. The rst one gives bounds on the coe cients of characteristic polynomials of trees (double directed trees), and conjectures the generalization of these bounds to MSDs. As a particular case, we prove that the independent coe cient of the characteristic polynomial of a tree or an MSD must be −1, 0 or 1. For trees, this fact means that a tree has at most one perfect matching; for MSDs, it means that an MSD has at most one covering by disjoint cycles. The property states that every MSD can be decomposed in a rooted spanning tree and a forest of reversed rooted trees, as factors. In our opinion, the analogies described suppose a signi cative change in the traditional point of view about this class of digraphs.